Partial Deduction for Structural Synthesis of Programs
نویسندگان
چکیده
The notion of partial deduction known from logic programming is deened in the framework of Structural Synthesis of Programs (SSP). Partial deduction for unconditional computability statements in SSP is deened. Completeness and correctness of partial deduction in the framework of SSP are proven. Several tactics and stopping criteria are suggested.
منابع مشابه
Partial Deduction in the Framework of Structural Synthesis of Programs
The notion of partial deduction known from logic programming is deened in the framework of Structural Synthesis of Programs (SSP). Partial deduction for unconditional computability statements in SSP is deened. Completeness and correctness of partial deduction in the framework of SSP are proven. Several tactics and stopping criteria are suggested.
متن کاملPartial Structural Synthesis of Programs
The notion of partial deduction known from logic programming is deened in the framework of Structural Synthesis of Programs (SSP). Partial deduction for computability statements in SSP is deened. Completeness and correctness of partial deduction in the framework of SSP are proven. Several tactics and stopping criteria are suggested.
متن کاملStrategies of Structural Synthesis of Programs and its Extensions
Proof search for the structural synthesis of programs (SSP) — a deductive program synthesis method which is suited for compositional programming in large and is in practical use in a number of programming environments is explained. SSP is based on a decidable logical calculus where complexity of the proof search is still PSPACE. This requires paying special attention to the efficiency of search...
متن کاملProgram Synthesis and Transformations in an Object-oriented Environment Program Synthesis and Transformations in an Object-oriented Environment
An object-oriented language with automatic synthesis of methods (programs) and transformations of OO descriptions using a logical metalanguage (Horn-clause logic) are considered. Automatic synthesis of methods (Proof-As-Program approach) is based on in-tuitionistic propositional calculus. The metalanguage expresses general knowledge related to classes and objects and it is used for describing t...
متن کاملProgram synthesis and transformations in an object-oriented environment
An object-oriented language with automatic synthesis of methods (programs) and transformations of OO descriptions using a logical metalanguage (Horn-clause logic) are considered. Automatic synthesis of methods (Proof-As-Program approach) is based on intuitionistic propositional calculus. The metalanguage expresses general knowledge related to classes and objects and it is used for describing tr...
متن کامل